Novel Parallel Architectures for Short-Time Fourier Transform
نویسنده
چکیده
where w(n) is an analysis window. At each time instant, the STFT is a discrete-time Fourier transform or discrete Fourier transform (DFT). Many DFT computing algorithms and architectures have been proposed. However, the direct use of the DFI' without considering the special sliding window effect of STFT is not an efficient approach. There are two major approaches for STFT. One is based on the filter bank approach and another is the FFT-based approach [l]. The filter bank approach can be described by the following two convolution sum equations,
منابع مشابه
Formation interface detection using Gamma Ray log: A novel approach
There are two methods for identifying formation interface in oil wells: core analysis, which is a precise approach but costly and time consuming, and well logs analysis, which petrophysists perform, which is subjective and not completely reliable. In this paper, a novel coupled method was proposed to detect the formation interfaces using GR logs. Second approximation level (a2) of GR log gained...
متن کاملParallel-Pipelined Radix-6 Multipath Delay Commutator FFT Architectures
The new Proposed design has been designed and developed by novel parallel-pipelined Fast Fourier Transform (FFT) architecture. The most important and fastest efficient algorithm is a FFT. FFT is used to computes the Discrete Fourier Transform (DFT). FFT is mainly applied in autocorrelation, spectrum analysis, linear filtering and pattern recognition system. The proposed architectures were desig...
متن کاملWindowing Effects of Short Time Fourier Transform on Wideband Array Signal Processing Using Maximum Likelihood Estimation
During the last two decades, Maximum Likelihood estimation (ML) has been used to determine Direction Of Arrival (DOA) and signals propagated by the sources, using narrowband array signals. The algorithm fails in the case of wideband signals. As an attempt by the present study to overcome the problem, the array outputs are transformed into narrowband frequency bins, using short time Fourier tran...
متن کاملPathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کاملA Parallel-Pipelined Constant Geometry Algorithm (PCGA) for Computation of FFT on a Special Processor
In digital signal processing applications, we usually use DFT (discrete Fourier transform) to transfer signal from time-domain to frequency-domain. In past decades, there were many papers discussing and exploiting FFT (fast Fourier transform) architectures for hardware implementation. In this paper, we proposed a novel VLSI FFT processor based on parallel-pipelined constant geometry algorithm (...
متن کامل